Parameterized complexity - PDFSEARCH.IO - Document Search Engine

Parameterized complexity
Results: 172

#	Item
101	Curriculum Vitæ (abridged) Luke Mathieson BSc BCompSc(Hons1) PGDipHEd MHEd PhD(Dunelm) Personal Details Add to Reading List Source URL: comp.mq.edu.au Language: English - Date: 2013-12-01 23:03:08 Parameterized complexity International Colloquium on Automata Languages and Programming Algorithm Symposium on Theoretical Aspects of Computer Science Michael Fellows Theoretical computer science Applied mathematics Computational complexity theory
102	Maximum Motif Problem in Vertex-Colored Graphs Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2009-06-21 01:15:30 Graph coloring NP-complete problems Graph theory Parameterized complexity NP-complete Theoretical computer science Mathematics Applied mathematics
103	Randomized and Parameterized Algorithms for the Closest String Problem Zhi-Zhong Chen Tokyo Denki University Joint with Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2014-06-14 17:20:02 Analysis of algorithms NP-complete problems Closest string Randomized algorithm String Time complexity Algorithm 2-satisfiability NP Theoretical computer science Computational complexity theory Applied mathematics
104	Lower bounds based on the Exponential Time Hypothesis Daniel Lokshtanov∗ Dániel Marx† Add to Reading List Source URL: www.win.tue.nl Language: English - Date: 2013-05-30 15:14:06 NP-complete problems Complexity classes Mathematical optimization Analysis of algorithms Parameterized complexity Exponential time hypothesis NP-complete Time complexity Feedback vertex set Theoretical computer science Computational complexity theory Applied mathematics
105	1 Fixed-Parameter Tractability In this chapter, we introduce parameterized problems and the notion of fixed-parameter tractability. We start with an informal discussion that highlights the main issues behind the definiti Add to Reading List Source URL: lii.rwth-aachen.de Language: English - Date: 2014-02-04 08:14:43 NP-complete problems Analysis of algorithms Computability theory Complexity classes Parameterized complexity Dominating set Time complexity Computable function Parameter Theoretical computer science Computational complexity theory Applied mathematics
106	Preprint. To appear in Algorithmica. DOIs00453 – Online available. On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion Nadja Betzler1 · Hans L. Bodlaender · Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2012-10-16 08:46:15 NP-complete problems Graph operations Analysis of algorithms Parameterized complexity Feedback vertex set Tree decomposition Vertex cover Dominating set Kernelization Graph theory Theoretical computer science Mathematics
107	Preprint. To appear in Data Mining and Knowledge Discovery. DOIs10618 – Online available. The Effect of Homogeneity on the Computational Complexity of Combinatorial Data Anonymization Robert Bredere Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2012-10-16 08:46:46 Analysis of algorithms Parameterized complexity Time complexity Anonymity Matrix NP-complete problems Theoretical computer science Computational complexity theory Applied mathematics
108	Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges Robert Bredereck1 , Jiehua Chen1 , Piotr Faliszewski2 , Jiong Guo3 , Rolf Niedermeier1 , and Gerhard J. Woeginger4 1 Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-12-01 07:16:49 Analysis of algorithms NP-complete problems Complexity classes Parameterized complexity Kernelization Vertex cover Time complexity Combinatorial optimization Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics
109	Parameterized Regular Expressions and Their Languages Pablo Barceló1 , Leonid Libkin2 , and Juan L. Reutter2 1 2 Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2011-09-27 14:42:30 Applied mathematics Automata theory EXPSPACE Regular language Regular expression Model theory PSPACE-complete FO Symbol Theoretical computer science Formal languages Complexity classes
110	How to Put Through Your Agenda in Collective Binary Decisions? Noga Alon1 , Robert Bredereck2 , Jiehua Chen2 , Stefan Kratsch2 Rolf Niedermeier2 , and Gerhard J. Woeginger3 2 Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-10-23 10:13:29 Complexity classes NP-complete problems Analysis of algorithms Parameterized complexity Mathematical optimization Vertex cover Dominating set Time complexity FO Theoretical computer science Computational complexity theory Applied mathematics

UPDATE